Complexity Sources in Fuzzy Description Logic
نویسندگان
چکیده
In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been proved to be undecidable. On the other hand, several FDLs based on finite t-norms, not only have been proved to be decidable, but they have been proved to belong to the same complexity classes as the corresponding crisp DLs. In light of such results, a question that naturally arises is whether the finite-valued fuzzy framework is no more complex than the crisp-valued formalism. The aim of this work is to analyze some of the complexity sources that are not present in the crisp framework. To this end, we will consider FDL languages with low expressivity that allow us to observe how the need for more complex deciding strategies, not required in the crisp framework, arises in manyvalued FDLs.
منابع مشابه
Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web∗
We present a novel approach to fuzzy description logic programs (or simply fuzzy dl-programs) under the answer set semantics, which is a tight integration of fuzzy disjunctive logic programs under the answer set semantics with fuzzy description logics. From a different perspective, it is a generalization of tightly coupled disjunctive dl-programs by fuzzy vagueness in both the description logic...
متن کاملRanking Services Using Fuzzy HEXPrograms
The need to reason with knowledge expressed in both Logic Programming (LP) and Description Logics (DLs) paradigms on the Semantic Web lead to several integrating formalisms, e.g., Description Logic programs (dl-programs) allow a logic program to retrieve results from and feed results to a DL knowledge base. Two functional extensions of dl-programs are HEX programs and fuzzy dl-programs. The for...
متن کاملThe Fuzzy Description Logic Alcflh
In this paper, we present the fuzzy description logic ALCFLH . ALCFLH is based on ALCFH , but linear hedges are used instead of exponential ones. This allows to solve the entailment and the subsumption problem in a fuzzy description logic, where arbitrary concepts and roles may be modified.
متن کاملDescription Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness
This paper is directed towards an infrastructure for handling both uncertainty and vagueness in the Rules, Logic, and Proof layers of the Semantic Web. More concretely, we present probabilistic fuzzy description logic programs, which combine fuzzy description logics, fuzzy logic programs (with stratified nonmonotonic negation), and probabilistic uncertainty in a uniform framework for the Semant...
متن کاملInformatik MCL Master ’ s Thesis on The Subsumption Problem of the Fuzzy Description Logic
Because of the simplicity in the structure of the Description Logic (DL) FL0, it has been commonly taken as the first example for the presentation of new notions and their associated problems [1],[2]. Fuzzy Description Logics extend classical Description Logics by allowing truth degrees to deal with imprecise concepts. In this work we show that in the fuzzy DL FL0 with greatest fixed-point sema...
متن کامل